Approximate Gröbner Bases, Overdetermined Polynomial Systems, and Approximate GCDs
نویسندگان
چکیده
منابع مشابه
Approximate Gröbner Bases and Overdetermined Algebraic Systems
We discuss computation of Gröbner bases using approximate arithmetic for coefficients. We show how certain considerations of tolerance, corresponding roughly to accuracy and precision from numeric computation, allow us to obtain good approximate solutions to problems that are overdetermined. We provide examples of solving overdetermined systems of polynomial equations. As a secondary feature we...
متن کاملPolynomial GCD and Factorization via Approximate Gröbner Bases
We discuss computation of approximate Gröbner bases at high but finite precision. We show how this can be used to deduce exact results for various applications. Examples include implicitizing surfaces, finding multivariate polynomial greatest common divisors and factorizations over the rational and complex number fields. This is an extended version of a paper for SYNASC 2010: Proceedings of the...
متن کاملCertiied Approximate Univariate Gcds
We study the approximate GCD of two univariate polynomials given with limited accuracy or, equivalently, the exact GCD of the perturbed polynomials within some prescribed tolerance. A perturbed polynomial is regarded as a family of polynomials in a clas-siication space, which leads to an accurate analysis of the computation. Considering only the Sylvester matrix singular values, as is frequentl...
متن کاملMultiple Roots and Approximate GCDs
The pejorative manifold was defined by Kahan in 1972. While multiple roots of a polynomial are naturally ill conditioned, we have that: if we know the multiplicities of the roots, then the roots are well conditioned. Consider a polynomial p with k distinct roots zi, the ith root has multiplicity mi, for i = 1, 2, . . . , k. The degree n of p is then the sum of multiplicities: n = m1 +m2 + · · ·...
متن کاملGröbner bases for polynomial systems with parameters
Gröbner bases are the computational method par excellence for studying polynomial systems. In the case of parametric polynomial systems one has to determine the reduced Gröbner basis in dependence of the values of the parameters. In this article, we present the algorithm GröbnerCover which has as inputs a finite set of parametric polynomials, and outputs a finite partition of the parameter spac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ISRN Computational Mathematics
سال: 2013
ISSN: 2090-7842
DOI: 10.1155/2013/352806